Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path

The problem of finding the shortest path from a or graph has been quite widely discussed. There are also many algorithms that solution to this problem. purpose study is analyze Greedy, A-Star, and Dijkstra in process path. author wants compare effectiveness three graph. From results research conducted, can conclude be determining with different results. Greedy algorithm fast solutions but tends not find optimal solution. While A-Star better than algorithm, must have complex data. Meanwhile, Dijkstra's case other two because it always gets